Studies on Tooth Surface Modification of Worm Gears. 3rd Report. For Worm Gears with a Large Number of Worm Threads.
نویسندگان
چکیده
منابع مشابه
Worm virulence estimation for the containment of local worm outbreak
A worm-infected host scanning globally may not cause any new infection in its underlying local network before it is detected and quarantined by a worm detector. To defend this type of scanning hosts, a number of worm scanner detection methods such as failed scan detection, honeypot, and dark port detection are proposed. However, for a stealthier worm limiting its scan inside an enterprise netwo...
متن کاملIntroducing Worm
In 1963 Sydney Brenner proposed to study the development of multi-cellular organisms using a genetic approach in a simple animal. He settled on a small, transparent nematode, Caenorhabditis elegans, which develops quickly and is anatomically simple with less than a thousand somatic cells. Almost half a century later there are many more researchers studying C. elegans than there are somatic cell...
متن کاملWorm sensation!
Mechanosensation plays a pivotal role in many aspects of pain pathology, yet the mammalian molecular transduction apparatus responsible for this sensory modality remains unknown. In January's edition of Nature Neuroscience, O'Hagan, Chalfie and Goodman [1] have provided direct electrophysiological evidence that somatic mechanotransduction in C. elegans is mediated by a complex of proteins previ...
متن کاملWorm Model
We present a method for tracking and distinguishing multiple C. elegans in a video sequence, including when they are in physical contact with one another. The worms are modeled with an articulated model composed of rectangular blocks, arranged in a deformable configuration represented by a spring-like connection between adjacent parts. Dynamic programming is applied to reduce the computational ...
متن کاملWORM colorings
Given a coloring of the vertices, we say subgraph H is monochromatic if every vertex of H is assigned the same color, and rainbow if no pair of vertices of H are assigned the same color. Given a graph G and a graph F , we define an F -WORM coloring of G as a coloring of the vertices of G without a rainbow or monochromatic subgraph H isomorphic to F . We present some results on this concept espe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C
سال: 1997
ISSN: 0387-5024,1884-8354
DOI: 10.1299/kikaic.63.3628